Nsga with Elitism Applied to Solve Multiobjective Optimization Problems
نویسندگان
چکیده
In this paper the effects of elitism in the Nondominated Sorting Genetic Algorithm (NSGA) are analyzed. Three different kinds of elitism: standard, clustering and Parks & Miller techniques are investigated using two test problems. For the studied problems, the Parks & Miller mechanism generated the best results. Finally, the NSGA with Parks & Miller elitism was applied to determine the nondominated front for a storage magnetic energy system and the IEEE 30node system. Simulation results obtained suggest the effectiveness of this proposed approach to solve real world problems.
منابع مشابه
Evolutionary multiobjective optimization using a cultural algorithm
In this paper, we present the first proposal to use a cultural algorithm to solve multiobjective optimization problems. Our proposal uses evolutionary programming, Pareto ranking and elitism (i.e., an external population). The approach proposed is validated using several examples taken from the specialized literature. Our results are compared with respect to the NSGA-II, which is an algorithm r...
متن کاملA Fast Elitist Multiobjective Genetic Algorithm: Nsga-ii
NSGA ( [5]) is a popular non-domination based genetic algorithm for multiobjective optimization. It is a very effective algorithm but has been generally criticized for its computational complexity, lack of elitism and for choosing the optimal parameter value for sharing parameter σshare. A modified version, NSGAII ( [3]) was developed, which has a better sorting algorithm , incorporates elitism...
متن کاملMultiobjective Optimization Solution for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملA Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملApplications of Genetic Algorithm for Solving Multi-Objective Optimization Problems in Chemical Engineering
49 Any real-world optimization problem involves several objectives. Chemical engineering is no exception. Chemical processes, such as distillation (Figure 1), refinery operations, polymerization, etc., involve a number of process parameters which are to be set for achieving certain properties in the final product. Often such a process is modelled using a number of differential and/or algebraic ...
متن کامل